How to Cut a Cake Before the Party Ends

نویسندگان

  • David Kurokawa
  • John K. Lai
  • Ariel D. Procaccia
چکیده

For decades researchers have struggled with the problem of envy-free cake cutting: how to divide a divisible good between multiple agents so that each agent likes his own allocation best. Although an envy-free cake cutting protocol was ultimately devised, it is unbounded, in the sense that the number of operations can be arbitrarily large, depending on the preferences of the agents. We ask whether bounded protocols exist when the agents’ preferences are restricted. Our main result is an envy-free cake cutting protocol for agents with piecewise linear valuations, which requires a number of operations that is polynomial in natural parameters of the given instance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Staphylococcal food poisoning from cream-filled cake in a metropolitan area of south-eastern Brazil.

Twelve people became ill with vomiting and diarrhoea approximately four hours after eating cake with a cream filling at a birthday party and on the day following. The cake had been prepared by a food handler who had long experience in preparing foods for such functions. Staphylococcus aureus that produced enterotoxin A was isolated from the nose, the fingernails, and a healed infection on the n...

متن کامل

Meta-envy-free Cake-cutting and Pie-cutting Protocols

This paper discusses cake-cutting protocols when the cake is a heterogeneous good, represented by an interval on the real line. We propose a new desirable property, the meta-envy-freeness of cake-cutting, which has not been formally considered before. Meta-envy-free means there is no envy on role assignments, that is, no party wants to exchange his/her role in the protocol with the one of any o...

متن کامل

A New Algorithm for the Cake-Cutting Problem of Unequal Shares for Rational Ratios: The Divisor Reduction Method

The cake-cutting problem is a long-researched question of resource allocation. The problem asks the following: How can a group of players fairly divide a continuous resource (the cake) in an efficient manner if each player has a personal valuation of portions of the resource? The definitions of “fair” and “efficient” can easily complicate the problem. A concept of fairness must be defined at a ...

متن کامل

Karen Horneys theory and Ehsan Tabaris political psychology

Purpose: Ehsan Tabari (1295-1368) was the unmistakable theoretician of the Tudeh party for more than 42 years and was also arrested and imprisoned after the political developments of the 1960s and the arrest of the leaders of this party. Shortly after his arrest in a television program, he said he has turned to Islam by reconsidering his past thoughts. Methodology: This event transformed Tabari...

متن کامل

BetterWays to Cut a Cake

I n this paper we show how mathematics can illuminate the study of cake-cutting in ways that have practical implications. Specifically, we analyze cake-cutting algorithms that use a minimal number of cuts (n − 1 if there are n people), where a cake is a metaphor for a heterogeneous, divisible good, whose parts may be valued differently by different people. These algorithms not only establish th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013